Undecidability of Uzawa equivalence theorem and LLPO (Lesser limited principle of omniscience)
نویسنده
چکیده
The Uzawa equivalence theorem [H. Uzawa, Walras’s Existence Theorem and Brouwer’s Fixed Point Theorem, Economic Studies Quarterly 8 (1962) 59–62] showed (classically) that the existence of Walrasian equilibrium in an economy with continuous excess demand functions is equivalent to Brouwer’s fixed point theorem, that is, the existence of a fixed point for any continuous function from an n-dimensional simplex to itself. We examine the Uzawa equivalence theorem from the point of view of constructive mathematics, and show that this theorem, properly speaking, the assumption of the existence of a Walrasian equilibrium price vector in this theorem, implies LLPO (Lesser limited principle of omniscience), and so it is non-constructive. 2008 Published by Elsevier Inc.
منابع مشابه
A Marriage of Brouwer’s Intuitionism and Hilbert’s Finitism I: Arithmetic
We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics (i.e., which part is equiconsistent with PRA or consistent provably in PRA) already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classic...
متن کاملWeihrauch Degrees, Omniscience Principles and Weak Computability
In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice with the disjoint union of multi-valued functions as greatest ...
متن کاملRamsey’s Theorem for pairs in k colors in the hierarchy of classical principles
The purpose of this work is to study, from the viewpoint of first order arithmetic (we have no set variables, the only sets are the arithmetical sets), Ramsey’s Theorem for pairs for a recursive assignment of k-many colors in order to find some principle of classical logic equivalent to it in HA. We proved that it is equivalent in HA to Σ3-LLPO, that is the Limited Lesser Principle of Omniscien...
متن کاملThe Bolzano-Weierstrass Theorem is the Jump of Weak König's Lemma
We classify the computational content of the Bolzano-Weierstraß Theorem and variants thereof in the Weihrauch lattice. For this purpose we first introduce the concept of a derivative or jump in this lattice and we show that it has some properties similar to the Turing jump. Using this concept we prove that the derivative of closed choice of a computable metric space is the cluster point problem...
متن کاملBounded modified realizability
We define a notion of realizability, based on a new assignment of formulas, which does not care for precise witnesses of existential statements, but only for bounds for them. The novel form of realizability supports a very general form of the FAN theorem, refutes Markov’s principle but meshes well with some classical principles, including the lesser limited principle of omniscience and weak Kön...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 201 شماره
صفحات -
تاریخ انتشار 2008